Virtual upstream channel scheduling in broadband communication systems

ABSTRACT

Scheduling virtual upstream channels within one physical upstream channel is disclosed. The MAP messages of the virtual upstream channels that share the same physical upstream channel are synchronized together such that any one transmission opportunity for a given virtual upstream channel does not overlap with transmission opportunities of any other virtual channel. This includes converting all requests for tranmission opprotunities into a common unit and then scheduling these requests as appropriate.

RELATED APPLICATIONS

This application claims priority from an earlier-filed provisionalpatent application entitled “Virtual Upstream Channels” filed on Aug.21, 2001.

FIELD OF THE INVENTION

The present invention relates to broadband communications systems. Moreparticularly, the present invention is directed to a upstream channelscheduling in broadband systems such as cable modem systems.

BACKGROUND

Recently, there has been an explosive demand for services, such as data,voice, and video, to be delivered over broadband communications systems.So-called cable modem technology is one of the most popular methods ofproviding such broadband services to subscribers. Cable modem technologycompetes with technologies such as Asymmetric Digital Subscriber Lines(ADSL) and ISDN (Integrated Services Digital Network). Many in theindustry forecast that cable modem systems will be the prevailingtechnology for providing broadband services since cable television isalready widely in use.

FIG. 1 illustrates a simplified diagram of a conventional cable modemsystem. The DOCSIS (Data Over Cable Service Interface Specifications)Radio Frequency Interface Specification specifies the transfer of IPtraffic, between the cable headend system and customer locations, overan all-coaxial or a hybrid-fiber/coax (HFC) cable network 52. Thetransmission path over the cable system is realized at the headend by aCable Modem Termination System (CMTS) 50, and at each customer locationby a Cable Modem (CM) 56. The DOCSIS standard defines a singletransmitter for each downstream channel—the CMTS 50. All CMs 56 listento all frames transmitted on the downstream channel upon which they areregistered and accept those where the destinations match the CM 56itself or CPEs (Customer Premises Equipment) 58 connected. CMs 56 cancommunicate with other CMs 56 only through the CMTS 50.

The upstream channel is characterized by many transmitters (i.e. CMs 56)and one receiver (i.e. the CMTS 50). Time in the upstream channel isslotted, providing for TDMA at regulated time ticks. The CMTS 50provides the time reference and controls the allowed usage for eachinterval. Intervals may be granted for transmissions by particular CMs56, or for contention by all CMs 56. CMs 56 may contend to requesttransmission time. To a limited extent, CMs 56 may also contend totransmit actual data. In both cases, collisions can occur and retriesare used.

The upstream Physical Media Dependent (PMD) sublayer uses a FrequencyDivision Multiple Access (FDMA)/TDMA burst modulation format, whichprovides five symbol rates and two modulation formats (Quadrature PhaseShift Keying (QPSK) and 16-QAM (Quadrature Amplitude Modulation)). Themodulation format includes pulse shaping for spectral efficiency, iscarrier-frequency agile, and has selectable output power level. The PMDsublayer format includes a variable-length modulated burst with precisetiming beginning at boundaries spaced at integer multiples of 6.25 secapart (which is 16 symbols at the highest data rate). Each burstsupports a flexible modulation, symbol rate, preamble, randomization ofthe payload, and programmable FEC (Forward Error Correction) encoding.All of the upstream transmission parameters associated with bursttransmission outputs from the CM 56 are configurable by the CMTS 50 viaMAC (Media Access Controller) messaging.

The upstream modulator is part of the CM 56 which interfaces with thecable network. The modulator contains the actual electrical-levelmodulation function and the digital signal-processing function; thelatter provides the FEC, preamble prepend, symbol mapping, and otherprocessing steps. The DOCSIS standard was developed with the idea ofbuffering the bursts in the signal processing portion, and with thesignal processing portion (1) accepting the information stream a burstat a time, (2) processing this stream into a complete burst of symbolsfor the modulator, and (3) feeding the properly-timed bursted symbolstream to a memoryless modulator at the exact burst transmit time. Thememoryless portion of the modulator only performs pulse shaping andquadrature upconversion.

At the Demodulator, similar to the Modulator, there are two basicfunctional components: the demodulation function and the signalprocessing function. Unlike the Modulator, the Demodulator resides inthe CMTS 50 and the DOCSIS standard envision that there will be onedemodulation function (not necessarily an actual physical demodulator)for each carrier frequency in use. The demodulation function wouldreceive all bursts on a given frequency.

The demodulation function of the Demodulator accepts a varying-levelsignal centered around a commanded power level and performs symboltiming and carrier recovery and tracking, burst acquisition, anddemodulation. Additionally, the demodulation function provides anestimate of burst timing relative to a reference edge, an estimate ofreceived signal power, an estimate of signal-to-noise ratio, and mayengage adaptive equalization to mitigate the effects of a) echoes in thecable plant, b) narrowband ingress and c) group delay. Thesignal-processing function of the Demodulator performs the inverseprocessing of the signal-processing function of the Modulator. Thisincludes accepting the demodulated burst data stream and decoding, etc.,and possibly multiplexing the data from multiple channels into a singleoutput stream. The signal-processing function also provides theedge-timing reference and gating-enable signal to the demodulatorsto-activate the burst acquisition for each assigned burst slot. Thesignal-processing function may also provide an indication of successfuldecoding, decoding error, or fail-to-decode for each codeword and thenumber of corrected Reed-Solomon symbols in each codeword. For everyupstream burst, the CMTS 50 has a prior knowledge of the exact symbolrate, preamble, and burst length.

Consider the case of two cable modems (CMs) that belong to differentcable segments communicating with a single Cable Modem TerminationSystem (CMTS) illustrated in FIG. 2. In the conventional cable modemsystem operation, each cable modem CM 630 and CM 620 would share asingle downstream path to obtain data/signals from the CMTS 610. Also,each cable modem CM 630 and CM 620 has its own upstream path to senddata/signals to the CMTS 610. Thus, two upstream frequencies and onedownstream frequency is used by the system of FIG. 2. The CMTS wouldhave a port for each CM 630 and CM 620 for the upstream traffic thereto,while having only one port for downstream traffic to both CM 630 and CM620. Since the port to which the CMs 630 and 620 are connected is known,the CMTS knows UCID (Upstream Channel Identifier, discussed below) toassign to each cable modem. Consequently, each UCID is associated withits own upstream frequency unique to the UCID in current DOCSISimplementations. Using the UCID it is possible for CMTS 610 to schedulethe CMs 620 and 630 on different upstream frequencies and then sendthese scheduling information on the bandwidth allocation MAP messages.The bandwidth allocation MAP messages are first parsed for the UCID bythe CM such that the CM would only listen to its own MAP messages thatcontain the scheduling information regarding the upstream channel that,it will be transmitting. If a DOCSIS downstream is associated with forexample, four upstreams, than the CMTS would send 4 bandwidth allocationMAP messages that each one specifies the bandwidth allocation to eachfrequency that it is associated.

The UCID is also associated with an Upstream Channel Descriptor (UCD).The Upstream Channel Descriptor defines multiple DOCSIS properties, suchas mini-slot size, symbol rate, frequency, and preamble pattern andburst descriptor. In sum it can be said that, the UCID defines how theCM communicates to CMTS on the Physical Media Dependent (PMD) sublayerof DOCSIS specification.

FIG. 3 describes DOCSIS bandwidth allocation and where transmitopportunities occur. The CMTS controls assignments on the upstreamchannel through the bandwidth allocation MAP and determines whichmini-slots are subject to collisions. The CMTS allows collisions oneither Requests or Data PDUs (Protocol Data Units). A “transmitopportunity” (“tx opportunity”) is defined as any mini-slot in which oneor more CMs may be allowed to start a transmission. The CMTS generatesthe time reference for identifying these slots.

For example, it may grant some number of contiguous slots to a CM for itto transmit a data PDU. The CM times its transmission so that the CMTSreceives it in the time reference specified. This section describes theelements of protocol used in requesting, granting, and using upstreambandwidth. The basic mechanism for assigning bandwidth management is thebandwidth allocation MAP.

Upstream bandwidth allocation is characterized as follows. The bandwidthallocation MAP is a MAC Management message transmitted by the CMTS onthe downstream channel which describes, for some interval of time, theuses to which the upstream frequency will be used by a given CM. A givenMAP may describe some time slots as grants for particular stations totransmit data in, other time slots as available for contentiontransmission, and other slots as an opportunity for new stations to jointhe link.

Many different scheduling algorithms may be implemented in the CMTS bydifferent vendors as DOCSIS does not mandate a particular algorithm.Instead, it describes the protocol elements by which bandwidth isrequested and granted. Each upstream channel is characterized by anUpstream Channel Descriptor (UCD). FIG. 4 illustrates basic structure ofa UCD message. A UCD is transmitted by the CMTS at periodic intervals todefine the characteristics of an upstream channel. A separate message istransmitted for each upstream that contains the following information:

-   -   Configuration Change Count: Incremented by one (modulo the field        size) by the CMTS whenever any of the values of this channel        descriptor change. If the value of this count in a subsequent        UCD remains the same, the CM can quickly decide that the        remaining fields have not changed, and may be able to disregard        the remainder of the message. This value is also referenced from        the MAP.    -   Mini-slot Size: The size T of the Mini-Slot for this upstream        channel in units of the Timebase Ticks of 6.25 s. Allowable        values are T=2^(M), M=1, . . . 7. That is, T=2, 4, 8, 16, 32, 64        or 128.    -   UCID: The identifier of the upstream channel to which this        message refers. This identifier is arbitrarily chosen by the        CMTS and is only unique within the MAC-Sublayer domain.    -   Downstream Channel ID: The identifier of the downstream channel        on which this message has been transmitted. This identifier is        arbitrarily chosen by the CMTS and is only unique within the        MAC-Sublayer domain.    -   Burst Descriptors: Burst Descriptors are composed of an upstream        Interval Usage Code, followed by encoding that defines, for each        type of upstream usage interval, the physical-layer        characteristics that are to be used during that interval. A        burst profile consists of a set of specific PHY (physical layer)        parameters-modulation, preamble length, Reed-Solomon block size,        Reed-Solomon error correction capability, scrambler seed,        differential encoding on/off, shortened last codeword mode        on/off, maximum burst size, and guard time size. Burst profiles        are assigned on an upstream channel basis in a downstream MAC        Management Message called the Upstream Channel Descriptor (UCD).        The idea was that multiple burst profiles could be defined and        that a cable modem (CM) would have these sets of parameters        stored in the PHY transmitter, and the CM could make use of        different burst profiles.

FIG. 5 illustrates The contents of overall channel information and burstdescriptors which are Type Length Value (TLV) encoded. The first threeTLVs that a UCD message contains symbol rate, frequency, and preamblesuperstring which applies to overall upstream channel. It also containsa plurality of burst descriptors which describes the characteristics ofthe upstream transmission depending on the Interval Usage Code (Table 1)of the transmission as scheduled by the CMTS with MAP messages.

FIG. 6 illustrates an upstream bandwidth allocation MAP message. Theupstream bandwidth allocation MAP is a varying-length MAC Managementmessage that is transmitted by the CMTS to define transmissionopportunities on the upstream channel. It includes a fixed-length headerfollowed by a variable number of information elements (IEs) messagewhich contains the information regarding:

-   -   Upstream Channel ID: The identifier of the upstream channel to        which this message refers.    -   UCD Count: Matches the value of the Configuration Change Count        of the UCD which describes the burst parameters which apply to        this map.    -   Number of Elements: Number of information elements in the map.    -   Alloc Start Time: Effective start time from CMTS initialization        (in mini-slots) for assignments within this map.    -   Ack Time: Latest time, from CMTS initialization, (mini-slots)        processed in upstream. This time is used by the CMs for        collision detection purposes.    -   Ranging Backoff Start: Initial back-off window for initial        ranging contention, expressed as a power of two. Values range        0-15 (the highest order bits must be unused and set to 0).    -   Ranging Backoff End: Final back-off window for initial ranging        contention, expressed as a power of two. Values range 0-15 (the        highest order bits must be unused and set to 0).

The allocation MAP is a varying-length MAC Management message that istransmitted by the CMTS to define transmission opportunities on theupstream channel. It includes a fixed-length header followed by avariable number of Information Elements (IEs) in the message beingtransmitted by the CMTS. The number of Transmit Opportunities associatedwith a particular Information Element (IE) in a MAP is dependent on thetotal size of the region as well as the allowable size of an individualtransmission.

FIG. 7 illustrates the format of Information Elements. Each IE consistsof a 14-bit Service ID, a 4-bit type code, and a 14-bit starting offset.Since all stations will scan all IEs, it is critical that IEs be shortand relatively fixed format. IEs within the MAP are strictly ordered bystarting offset. For most purposes, the duration described by the IE isinferred by the difference between the IEs starting offset and that ofthe following IE. For this reason, a Null IE terminates the list.

Table 1 below lists IEs and their corresponding Interval Usage Codes(IUCs).

TABLE 1 Information Elements and IUCs Interval Usage Code InformationElement Name 1 Request 2 REQ/Data 3 Initial Maintenance 4 StationMaintenance 5 Short Data Grant 6 Long Data Grant 7 Null IE 8 DataAcknowledge 9-14 Reserved 15  Expanded IUC

As an example, assume a REQ (Request) IE defines a region of 12mini-slots. If the UCD defines a REQ Burst Size that fits into a singlemini-slot then there are 12 Transmit Opportunities associated with thisREQ IE, i.e., one for each mini-slot. If the UCD defines a REQ that fitsin two mini-slots, then there are six Transmit Opportunities and a REQcan start on every other mini-slot.

As another example, assume a REQ/Data IE that defines a 24 mini-slotregion. If it is sent with an SID of 0x3FF4, then a CM can potentiallystart a transmit on every fourth mini-slot; so this IE contains a totalof six Transmit Opportunities (TX OPs). Similarly, a SID of 0x3FF6implies four TX OPs; 0x3FF8 implies three TX OPs; and 0x3FFC implies twoTX OPs.

For an Initial Maintenance IE, a CM starts its transmission in the firstmini-slot of the region; therefore it has a single Transmit Opportunity.The remainder of the region is used to compensate for the round tripdelays since the CM has not yet been ranged. Station Maintenance IEs,Short/Long Data Grant IEs and unicast Request IEs are unicast and thusare not typically associated with contention Transmit Opportunities.They represent a single dedicated, or reservation based, TransmitOpportunity.

FIG. 8 illustrates the format of a DOCSIS MAC frame. A frame is a unitof data exchanged between two (or more) entities at the Data Link Layer.A MAC frame consists of a MAC Header and may incorporate avariable-length data PDU. The variable-length PDU includes a pair of48-bit addresses, data, and a CRC (Cyclic Redundancy Check). In specialcases, the MAC Header may encapsulate multiple MAC frames into a singleMAC frame. A MAC frame is the basic unit of transfer between MACsublayers at the CMTS and the cable modem. The same basic structure isused in both the upstream and downstream directions. MAC frames arevariable in length. The term “frame” is used in this context to indicatea unit of information that is passed between MAC sublayer peers.Preceding the MAC frame is either PMD sublayer overhead (upstream) or anMPEG (Motion Picture Experts Group) transmission convergence header(downstream). The first part of the MAC frame is the MAC Header. The MACHeader uniquely identifies the contents of the MAC frame.

FIG. 9 illustrates the interchange between the CM and the CMTS when theCM has data to transmit Suppose a given CM has a data PDU available fortransmission.

1. At time t₁, the CMTS transmits a MAP whose effective starting time ist₃. Within this MAP is a Request IE which will start at t₅. Thedifference between t₁ and t₃ is needed to allow for:

-   -   Downstream propagation delay (including FEC interleaving) to        allow all CMs to receive the Map    -   Processing time at the CM (allows the CMs to parse the Map and        translate it into transmission opportunities)    -   Upstream propagation delay (to allow the CMs transmission of the        first upstream data to begin in time to arrive at the CMTS at        time t₃);

2. At t₂, the CM receives this MAP and scans it for requestopportunities. In order to minimize request collisions, it calculates t₆as a random offset based on the Data Backoff Start value in the mostrecent MAP;

3. At t₄, the CM transmits a request for as many mini-slots as needed toaccommodate the PDU. Time t₄ is chosen based on the ranging offset sothat the request will arrive at the CMTS at t₆.

4. At t₆, the CMTS receives the request and schedules it for service inthe next MAP. (The choice of which requests, to grant will vary with theclass of service requested, any competing requests, and the algorithmused by the CMTS.)

5. At t₇, the CMTS transmits a MAP whose effective starting time is t₉.Within this MAP, a data grant for the CM will start at t₁₁.

6. At t₈, the CM receives the MAP and scans for its data grant.

7. At t₁₀, the CM transmits its data PDU so that it will arrive at theCMTS at t₁₁. Time t₁₀ is calculated from the ranging offset as in step3.

Steps 1 and 2 need not contribute to access latency if CMs routinelymaintain a list of request opportunities. At Step 3, the request maycollide with requests from other CMs and be lost. The CMTS does notdirectly detect the collision. The CM determines that a collision (orother reception failure) occurred when the next MAP fails to includeacknowledgment of the request. The CM will then perform a back-offalgorithm and retry.

At Step 4, the CMTS scheduler fail to accommodate the request within thenext MAP. If so, it will reply with a zero-length grant in that MAP ordiscard the request by giving no grant at all. It will continue toreport this zero-length grant in all succeeding maps until the requestcan be granted or is discarded. This will signal to the CM that therequest is still pending. So long as the CM is receiving a zero-lengthgrant, it will not issue new requests for that service queue.

DOCSIS allows various combinations of upstream and downstream channelswithin one MAC service access point. The upstream bandwidth allocationprotocol allows for multiple upstream channels to be managed via one ormany downstream channels. If multiple upstream channels are associatedwith a single downstream channel, then the CMTS sends one bandwidthallocation MAP per upstream channel. The bandwidth allocation MAP'schannel identifier, taken with the Upstream Channel Descriptor Message,specifies to which channel each bandwidth allocation MAP applies. Thereis no requirement that the maps be synchronized across channels.

When a DOCSIS certified CM reboots it first scans for a downstreamchannel (it first looks into the stored last operational parameters). Adownstream channel is considered valid when

-   -   synchronization of the QAM symbol timing    -   synchronization of the FEC framing    -   synchronization of the MPEG packetization    -   recognition of SYNC downstream MAC messages is achieved.

After synchronization, the CM will wait for an upstream channeldescriptor message (UCD) from the CMTS in order to retrieve a set oftransmission parameters for a possible upstream channel. These messagesare transmitted periodically from the CMTS for all available upstreamchannels and are addressed to the MAC broadcast address. The CM willdetermine whether it can use the upstream channel from the channeldescription parameters.

The CM would then pick one of the upstream channel IDs in its table andwait for the initial ranging period for this upstream channel ID in thebandwidth allocation MAP signal, and try to range in the timeframeallocated. If initial ranging is not successful, then the next upstreamchannel ID is selected, and the procedure restarted from UCD extraction.When there are no more channel IDs to try, then the CM will continuescanning to find another downstream channel.

The ranging request message does not include an Upstream Channel IDsince it is inherently assumed in DOCSIS that the frequency defines theUpstream Channel ID. Due to this reason the DOCSIS specificationmandates that the CM have to use whatever Upstream Channel ID isreturned by the CMTS in the Ranging Response message. In other wordseven though the CM may choose any Upstream Channel ID to transmit theinitial ranging request the CMTS has the ultimate power to make the CMto use a certain Upstream Channel ID.

From this point on the CM is to use the given Upstream Channel ID, whenit is parsing for the transmission opportunities the CM has to firstfind the one with matching Upstream Channel ID. And then parse thebandwidth allocation MAP to find the SIDs that it is using. After theregistration it is possible that the CM would receive a Upstream ChannelChange Request message stating that it has to switch to a differentUpstream Channel ID. The CM in response will be sending two UpstreamChannel Change Response messages in the same frequency one that statesthe reception of the Upstream Channel Change request. Afterwards the CMis to parse for Upstream Channel ID bandwidth allocation MAP message fortransmission opportunities send to broadcast SIDs or SIDs that belong tothe CM.

If multiple downstream channels are associated with a single upstreamchannel, the CMTS must ensure that the bandwidth allocation MAP reachesall CMs. That is, if some CMs are attached to a particular downstreamchannel, then the bandwidth allocation MAP will be transmitted on thatchannel. This may necessitate that multiple copies of the same bandwidthallocation MAP be transmitted. The Alloc Start Time in the bandwidthallocation MAP header will always relate to the SYNC reference on thedownstream channel on which it is transmitted.

If multiple downstream channels are associated with multiple upstreamchannels, the CMTS may need to transmit multiple copies of multiple mapsto ensure both that all upstream channels are mapped and that all CMshave received their needed maps.

After synchronization, the CM will wait for an upstream channeldescriptor message (UCD) from the CMTS in order to retrieve a set oftransmission parameters for a possible upstream channel. The UCDmessages are transmitted periodically from the CMTS for all availableupstream channels and are addressed to the MAC broadcast address. The CMwill determine whether it can use the upstream channel from the channeldescription parameters.

The CM will collect all UCDs, which are different in their upstreamchannel ID field to build a set of usable channel IDs. If no channel canbe found after a suitable timeout period, then the CM will continuescanning to find another downstream channel. The CM determines whetherit can use the upstream channel from the channel description parameters.If the channel is not suitable, then the CM will try the next upstreamchannel ID until it finds a usable channel. If the channel is suitable,the CM will extract the parameters for this upstream from the UCD. Itthen will wait for the next SYNC message and extract the upstreammini-slot timestamp from this message. The CM then will wait for abandwidth allocation MAP for the selected channel. It may begintransmitting upstream in accordance with the MAC operation and thebandwidth allocation mechanism.

The CM will perform initial ranging at least once. If initial ranging isnot successful, then the next upstream channel ID is selected, and theprocedure restarted from UCD extraction. When there are no more channelIDs to try, then the CM will continue scanning to find anotherdownstream channel. At any time after registration, the CMTS may directthe CM to change its upstream channel. This can be done for trafficbalancing, noise avoidance, or any of a number of other reasons.

FIG. 10 illustrates an example of a single downstream channel and fourupstream channels. In FIG. 10, the four upstream channels are onseparate fibers serving four geographical communities of modems. TheCMTS has access to the one downstream and all four upstreams, while eachCM has access to the one downstream and only one upstream.

In this topology, the CMTS transmits Upstream Channel Descriptors (UCDs)and MAPs for each of the four upstream channels related to the shareddownstream channel. Unfortunately, each CM cannot determine which fiberbranch it is attached to because there is no way to convey thegeographical information on the shared downstream channel. Atinitialization, the CM randomly picks a UCD and its corresponding MAP.The CM then chooses an Initial Maintenance opportunity on that channeland transmits a Ranging Request.

The CMTS will receive the Ranging Request and will redirect the CM tothe appropriate upstream channel identifier by specifying the upstreamchannel ID in the Ranging Response. The CM will then use the upstreamchannel ID of the Ranging Response, not the channel ID on which theRanging Request was initiated. This is necessary only on the firstRanging Response received by the CM. The CM will continue the rangingprocess normally and proceed to wait for station maintenance IEs. Fromthen on, the CM will be using the bandwidth allocation MAP that isappropriate to the fiber branch to which it is connected. If the CM everhas to redo initial maintenance, it may start with its previous knownUCD instead of choosing one at random.

Below are the MAC messages that contain Channel Ids:

-   -   Upstream Channel Descriptor    -   Bandwidth Allocation MAP    -   Ranging Response    -   Dynamic Channel Change request

With unsynchronized timestamps:

-   -   Since upstream synchronization relies on downstream timestamps,        each upstream channel must be associated with the time stamp of        one of the downstream channels.    -   The downstream channels should only transmit MAP messages and        UCD messages that pertain to their associated upstream channels.

To highlight the key points of conventional architectures, currentDOCSIS implementations use one frequency per DOCSIS Upstream Channel:

-   -   Only two upstream burst profiles are available for data that is        granted;    -   There are rules defining which of the two burst profiles is used        based solely upon MAC PDU length; and    -   All CMs on the same upstream channel use the same mini-slot        size, symbol rate, and burst profiles.

FIG. 11 illustrates a DOCSIS System with cable modems of different noiselevels. For example, suppose on an upstream channel, some CMs canachieve adequate upstream Bit Error Rate (BER) performance using 16-QAMand a relatively low error-correcting Reed-Solomon code while othersrequire QPSK and more Reed-Solomon error correction as depicted in FIG.11. The modems depicted on the upper portion have better performance(such that a less robust more efficient burst profile can be used) ontheir portion of the cable segment such that they can sustain a 16-QAMmodulation whereas the CMs on the lower portion has a worse performingcable segment (needs more robust hence less efficient burst profile)such that they can only sustain acceptable BER with QPSK modulation.

If these CMs are to run on the present DOCSIS systems, and it is desiredto provide all CMs with adequate BER performance, the upstream channeldescriptor parameters will have to accommodate the CMs experiencing theless robust transmission, in other words the DOCSIS upstream channel hasto be used as if all the CMs are in the same noise/performancecharacteristics of the worst connection as shown in FIG. 12. In FIG. 12all CMs are forced to QPSK modulation.

However, this is a sacrifice to the CMs, which can successfully use16-QAM and less Reed-Solomon parity, and it is a sacrifice to the systemas a whole because the capacity of the upstream channel could be muchbetter utilized by some CMs as opposed to others.

Segregating modems into two distinct upstream frequencies has a numberof objections. In some cases, from a node, there will only be oneupstream frequency available, all the other frequencies will be used forother purposes such as Video on demand, non-DOCSIS voice transport.Also, the number of CMs in the high and low error rate categories maynot correspond well with the available capacity of the differentchannels provided to them. For example it is possible that only a copeof modems are in the high noise region that requires QPSK modulation.

One solution is to segregate CMs experiencing higher error rates onparticular frequencies that run at more robust transmission modes.Assume that as depicted in FIG. 13 there are two DOCSIS upstreamfrequencies (RF Frequency #1 and RF Frequency #2 with upstream channeldescriptors set as such that the CMs with lower noise will run 16-QAMand higher will run in QPSK mode with proper settings. Anotherconsideration is that high utilization on a particular channelassociated with a particular level of BER performance may preventanother CM from being assigned to it, and thus, the CM is put on anotherchannel where it really does not belong. It would be much more efficientfrom a system standpoint to have the ability to handle both on the samechannel.

It would seem impairments impact all CMs on, an upstream plant orupstream channel, and thus, allowing some CMs to use 16-QAM and lessReed-Solomon parity and others QPSK and that more Reed-Solomon parity isnot necessary. For Additive White Gaussian Noise, impulse noise, ornarrowband ingress, the noise “funneling” effect of the upstream HFCplant (by nature of the topology) results in impact on all users on thatupstream channel. So, knowledge of the level of these impairments on anupstream channel helps to determine the baseline burst profileparameters to be set to make the upstream transmission robust. This canbe done in an automated fashion by a CMTS with advanced channelmonitoring capabilities.

However, there are other impairments that do not impact all CM signalsreceived in the upstream, but may only impact a particular CM or CMs ona segment of the plant. For example, impairments and distortion can bedue to a tap or amplifier that is malfunctioning or has degraded. Or forexample, a particular CM may have a degraded component or suffer anon-fatal fault that impacts its transmission performance. In thesecases, it would be possible for the CMTS, through its channel monitoringfunctions, to ascertain which CM or CMs are impacted, and it would bebeneficial that these modems could be assigned upstream channels thatcould better overcome their localized impairments.

Recently, one innovation in channel architecture has been theintroduction of ‘virtual upstream channels’ which are used to segregatea single physical upstream channel. Each virtual upstream channel cangroup together a set of cable modems. New virtual upstream channels maybe added and existing virtual upstream channels may be removed asdesired. However, a challenging aspect of using virtual upstreamchannels are problems with scheduling these channels to use the physicalupstream channel with minimal contention. Thus, there is a need ascheduling system that the CMTS can employ so that virtual upstreamchannels are not scheduled simultaneously.

SUMMARY OF THE INVENTION

A method and apparatus for scheduling virtual upstream channels withinone physical upstream channel is disclosed. In one embodiment, the MAPmessages of the virtual upstream channels that share the same physicalupstream channel are synchronized together such that any onetransmission opportunity for a given virtual upstream channel does notoverlap with transmission opportunities of any other virtual channel.This may be achieved by converting all requests for tranmissionopportunities into a common unit and then scheduling these requests asappropriate.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a simplified diagram of a conventional cable modemsystem;

FIG. 2 illustrates the case of two cable modems (CMs) communicating witha single Cable Mode Termination System (CMTS);

FIG. 3 describes DOCSIS bandwidth allocation and where transmitopportunities occur;

FIG. 4 illustrates an exemplary UCD;

FIG. 5 illustrates an Upstream Channel Descriptor Message;

FIG. 6 illustrates an upstream bandwidth allocation MAP message;

FIG. 7 illustrates the format of Information Elements;

FIG. 8 illustrates the format of a DOCSIS MAC frame;

FIG. 9 illustrates the interchange between the CM and the CMTS when theCM has data to transmit Suppose a given CM has a data PDU available fortransmission;

FIG. 10 illustrates an example of a single downstream channel and fourupstream channels.

FIG. 11 illustrates a DOCSIS System with cable modems of different noiselevels;

FIG. 12 illustrates a DOCSIS System with cable modems forced to operateusing QPSK modulation;

FIG. 13 illustrates an unequal number of CMs with different noisemargins;

FIG. 14 illustrates virtual upstream channels and associated cablemodems which are serviced by the scheduling system of the invention;

FIG. 15 illustrates an exemplary time division multiplexing of twovirtual upstream channels;

FIG. 16 illustrates another example of the division of upstream channeltransmission time.

FIG. 17 illustrates virtual upstream channels with different requestcontention area latencies;

FIG. 18 illustrates virtual upstream channels using joint contentionareas.

DETAILED DESCRIPTION OF THE INVENTION

In brief, the invention, in various embodiments, consists of a methodand apparatus for the design and implementation of a CMTS schedulingsystem to work with virtual upstream channels. In general, the CMTSscheduling system recognizes what virtual upstream channels share thesame physical upstream channel and schedule these such that they do notuse the same transmission area at the same time. For each virtualupstream channel that is desired, a separate bandwidth allocation MAPmessage is sent by the CMTS on the same physical upstream channel. TheseMAp messages can be synchronized such that transmission areas do notoverlap. One means of achieving synchronization of MAP messages is toconvert requests (which may be different in size/timing) for bandwidthallocation into a common unit and then perform the scheduling inresponse to the requests. The scheduling system can be implemented usinga variety of Information Elements (IEs) schemes for the MAP messages,including the use of null and placeholder Service Identifiers (SIDS).The scheduling system can also allocate bandwidth based upon a widevariety of quality of service and other constraints. In one embodiment,the scheduling system provides its best efforts to optimize theutilization of the physical upstream channel by the CMs. In otherembodiments, the scheduling system provides best efforts latencydifferentiation among CMs. Latency differentiation will allow slower CMsto transmit user data proportionately more frequently than faster CMs inorder to provide reduced perceived latency for users of the slower CMs.

Virtual Upstream Channel MAP Message Construction

The CMTS can be configured to generate a MAP message for each virtualupstream channel. The effective result of sending a MAP message for eachvirtual upstream channel will be to decrease overall utilization of thedownstream channel. Referring to FIG. 14, for example, assume that thevirtual channel #1 and virtual upstream channel #2 share the samefrequency (i.e. the same physical upstream channel). And further, assumethat the virtual upstream channel #1 has two CMs A and B assigned to it,and that the virtual upstream channel #2 has two CMs C and D assignedit. Also, assume that virtual upstream channel #1 is working in a QPSKmodulation scheme and virtual upstream channel #2 is working in a 16-QAMmodulation scheme.

An exemplary time division multiplexing of such a configuration isdepicted in FIG. 15. Virtual upstream channel #1 uses the firstavailable upstream timeframe between t1 and t5. Afterwards, virtualupstream channel #2 uses the remaining upstream timeframe from t5 to t9.For this example of upstream channel division, the CMTS will generatetwo bandwidth allocation MAP messages as follows:

IEs of the bandwidth allocation MAP for the virtual upstream channel #1SID IUC Offset x3FFF 1 t1 x0001 6 t2 x0002 6 t3 x3FFF 3 t4 x0000 6 t5x0000 0 t9

IEs of the bandwidth allocation MAP for the virtual upstream channel #2SID IUC Offset x0000 6 t1 x3FFF 1 t5 x0003 6 t6 x0004 6 t7 x3FFF 3 t8x0000 0 t9

The above example assumes that the virtual upstream Channels usedifferent symbol rates, preambles or mini-slot sizes such that it is notpossible (or may be desired) for each group to share the requestcontention area or initial ranging area. Such “joint request contentionareas” are covered in further detail below. The null SID x0000 is usedas a space holder to state that another CM will perhaps use thetimeframe. In the above case, in the time area defined between offset t1through t5, the MAP of virtual upstream channel #2 has a null SID,indicating that another virtual upstream channel could be transmittingin that time area. When this is considered along with the the MAP forvirtual upstream channel #1, which indicates that its CMs (SIDs x0001and x0002) are transmitting during this time, then it can be observedthat the virtual upstream channel #2 does not interfere in thetransmission area of virtual upstream channel #1. Likewise, the MAPmessage for virtual upstream channel #1 shows a null SID during the timearea defined by offset t5 through t9, indicating that another virtualupstream channel is using that time area. When viewed in conjunctionwith the MAP message for virtual upstream channel #2, it can be observedthat virtual upstream channel uses the time from t5 thorugh t9 for itstransmission. The greater the number of virtual upstreams, the morecomplex is the synchronization of MAP messages but the same principleswould apply. For instance, three virtual upstream channels would havethree MAP messages, each MAP message reflecting two time areas that itcannot use and one time area that it does use. It is possible to use theSID(s) that belong to other virtual upstream channels in these spaces.The above-mentioned bandwidth allocation MAP messages can be reduced insize if the assumption (not a DOCSIS requirement) that the bandwidthallocation MAP messages should cover the entire timeframe is relaxed. Inthis case, the messages with the null SID (x0000) can be deleted and thebandwidth allocation MAP messages would become as follows:

IEs of the bandwidth allocation MAP for the virtual upstream channel 1:SID IUC Offset x3FFF 1 t1 x0001 6 t2 x0002 6 t3 x3FFF 3 t4 x0000 0 t5

IEs of the bandwidth allocation MAP for the virtual upstream channel 2:SID IUC Offset x3FFF 1 t5 x0003 6 t6 x0004 6 t7 x3FFF 3 t8 x0000 0 t9

Each of the above MAP messages have information that only pertains toCMs within the virtual upstream channels that they service. It can beinferred that since offset t5 through t9 is only defined in the MAPmessage for virtual upstream channel #2, that the other areas defined byother offsets are not used by virtual upstream channel #2. The CMs ineach virtual upstream channel group will be within the same MAC domain,and thus, each of the CMs in an upstream frequency will have unique SID.

Another example of division of the upstream channel transmission time isdepicted in FIG. 16. In this example, the virtual upstream channels havea distributed and haphazard time area division. Such a division may bedue to quality of service guarantees and other requirements. As shown,the total transmission time (area) defined from offset t1 to offset t9is shared in an alternating fashion by both virtual upstream channel #1and virtual upstream channel #2. Data transmission (at offset t5 tooffset t6) from CM C (which belongs to virtual upstream channel #2) isfollowed by data transmission (at offset t6 to offset t7) from CM A(which belongs to virtual upstream channel #1). Then, data transmission(at offset t7 to offset t8) from CM D (which belongs to virtual upstreamchannel #2) is followed by data transmission (at offset t8 to offset t9)from CM A (which belongs to virtual upstream channel #1). In such acase, the two MAP messages would look like:

IEs of the bandwidth allocation MAP for the virtual upstream channel #1SID IUC Offset x3FFF 1 t1 x0000 6 t2 x3FFF 3 t3 x0000 6 t4 x0001 6 t6x0000 6 t7 x0002 6 t8 x0000 7 t9

IEs of the bandwidth allocation MAP for the virtual upstream channel #2SID IUC Offset x0000 1 t1 x3FFF 6 t2 x0000 3 t3 x3FFF 6 t4 x0003 6 t5x0000 6 t6 x0004 6 t7 x0000 6 t8 x0000 7 t9

Instead of using null IEs (i.e. SIDs of x0000), if we assume that CMswill be acting as specified by DOCSIS then it is possible to use insteadof nulls, only the SID values that use the actual channel. In such acase, then the MAP messages will look like:

IEs of the bandwidth allocation MAP for the virtual upstream channel #1SID IUC Offset x3FFF 1 t1 x0000 6 t2 x3FFF 3 t3 x0000 6 t4 x0003 6 t5x0001 6 t6 x0004 6 t7 x0002 6 t8 x0000 7 t9

IEs of the bandwidth allocation MAP for the virtual upstream channel #2SID IUC Offset x3FFF 1 t1 x0000 6 t2 x3FFF 3 t3 x0000 6 t4 x0003 6 t5x0001 6 t6 x0004 6 t7 x0002 6 t8 x0000 7 t9

In the case where is a need for a number of place holder SIDs thatcannot be used for other purposes. The four basic SIDs per unspecifiedVirtual Upstream Channel denote:

-   -   Request;    -   REQ/Data; and    -   Initial Maintenance.

Depending on the complexity of the MAP messages, the number of placeholder SIDs would increase. It is possible to use the unused otherchannel SID values for place holders thereby practically reducing thenumber of place holder SIDs to zero.

CMTS Scheduler Bandwidth Calculation

The complexity of the CMTS scheduler depends upon the type and varianceof quality of service constraints. The below exemplifies some of thevariations of schedulers depending on quality of service constraints.

The first of these, is for the CMTS Scheduler provide best effortservices for the utilization of the upstream channel. The basic idea isto increase upstream channel utilization. In order to do so, the variousgroups of cable modems use different modulation/preamble/mini-slotsize/symbol rate and other than that, the scheduler needs no specialconditions placed upon it.

One means of achieving this is to map all the bandwidth requests into aunified form and then process it. For example, if virtual upstreamchannel #1 is using a symbol rate of 160 kilo-symbols per second whilevirtual upstream channel #2 is using a symbol rate of 320 kilo-symbolsper second then all that has to be done is to convert everything intotimer ticks and then schedule the timer ticks using the table given inAppendix A. The result of such a scheduler might most probably be asdepicted in FIG. 16.

Another of these variations in quality of service, is for the CMTSScheduler to provide best effort latency differentiation. In this case,the scheduler uses different MAP intervals for the two virtual upstreamchannels (assuming two virtual upstream channels as in the exampleabove). The scheduler design is more complex in this case than in thebest effort of utilization case since simple request translation intothe fastest channel would not be sufficient. Another issue thatcomplicates the scheme is that the use of DOCSIS advanced quality ofservice constraints. If the scheduler and MAP intervals do not followsome rules, it is possible that the two virtual upstream channels cannotmeet their quality of service constraints due to conflictingrequirements.

These kinds of conflicts are very easy to solve if the flow admissioncontrol is intelligent and especially the UGS (unsolicited grantservice) flows are admitted knowing about the all virtual upstreamchannels that share the same physical upstream frequency.

The Use of IEs SID Values Between Virtual Upstream Channels

If virtual upstream channels are being used, the CMTS has to send thebandwidth allocation messages in such a way that no two CMs would sendtheir non-contention area frame in the timeframe allocated for the otherunless it is an intentional action. An example of such kind of a desiredbehavior is to content some number of modems to release their queue fromunwanted IP packets that are waiting to be transmitted. In other words,the scheduler gives the unicast data opportunities in such a way that inthe MAP messages that in all of the MAP messages there is only one MAPmessage that gives unicast data opportunity that has a Cable Modem whichhas requested bandwidth and is waiting to transmit its data.

Referring back to the example of FIG. 14, it is possible for the CMTS toconstruct two virtual upstream channels in the same DOCSIS physicalupstream frequency thereby increasing the utilization of the DOCSISupstream frequency, and at the same time not using a new DOCSIS physicalupstream frequency. In the system that is depicted, the CMTS associatestwo Upstream Channel Descriptors (UCDs) with the same frequency.

One means of organizing the various opportunities provided in a physicalupstream frequency that uses two virtual upstream channels is shown inTable 2. Table 2 shows time synchronized mapping of IEs that belong totwo virtual upstream (VU) channels that share the same upstreamfrequency and cable segment.

TABLE 2 Mapping of IEs, transmit opportunities. IEs of VU Channel #1 IEsof VU Channel #2 1 Unicast transmission A transmission opportunityopportunity for a VU 1 CM that no CM that belongs to VU 2 would use 2 Atransmit opportunity Unicast transmission that no CM that belongsopportunity for a VU 2 CM to VU 1 would use 3 Unicast transmissionUnicast transmission opportunity for a VU 1 CM opportunity for a VU 2 CM4 Broadcasted transmission A transmission opportunity opportunity forCMs that that no CM that belongs to belong VU 1 VU 2 would use 5 Atransmission Broadcasted transmission opportunity that no CM opportunityfor CMs that that belongs to VU 1 belong VU 2 would use 6 Broadcastedtransmission Broadcast transmission opportunity for CMs that opportunityfor CMs that belong VU 1 belong VU 2 7 Multicast transmission Atransmission opportunity opportunity for a VU 1 CM that no CM thatbelongs to VU 2 would use 8 A transmit opportunity Multicasttransmission that no CM that belongs opportunity for a VU 2 CM to VU 1mould use 9 Multicast transmission Multicast transmission opportunityfor a VU 1 CM opportunity for a VU 2 CM

The CMTS, in this example, would be sending two bandwidth allocation MAPmessages which does not allocate the time that one virtual upstream onthe same channel is using to the other virtual upstream(s) that sharethe same frequency. This is depicted in Table 2 showing MAP messagesthat are sent to two virtual upstream channels. It is possible to extendthe table to more than two virtual upstream channels but for sake ofsimplicity such a table it is not described. For ease of understanding,the case of two virtual upstream channels per upstream frequency isgiven as example. The concepts that apply to the two, virtual upstreamchannels per frequency case can be extended to cases where there aremore than two virtual upstream channels per frequency case, as well.

In Table 2, the first type of transmission opportunity is a unicasttransmission opportunity that is being used by virtual upstream channel#1 and the MAP of virtual upstream channel #2 points to an opportunitythat is known that no CM would transmit. This can be a unicasttransmission opportunity given to a null SID, or to a SID that does notbelong to virtual upstream channel #2 and therefore, will not be parsedby the CM owning that SID.

The second type of transmission opportunity is the same as the first onebut with the difference that this time the transmission opportunitybelongs to a CM that belongs to virtual upstream channel #2 and virtualupstream channel #1 points to an transmission opportunity that is knownthat no CM would transmit. The first two kinds of transmissionopportunities can be referred to as “unicast” data opportunities due tothe fact that it is made sure that the transmission will not becontended by any other CM.

The third type of opportunity is the one in which two CMs are allowed totransmit data. These can be polled data request areas or intentionaldata contention to get rid of the data backlog in the CMs. The CMTSscheduler is responsible to make sure that the expected behavior isexecuted.

The fourth type of transmission opportunity is that the CMs on virtualupstream channel #1 are given a transmission opportunity and the MAP ofvirtual upstream channel #2 points to an opportunity where it is knownthat no CM would transmit. This type of behavior is typical when virtualupstream channel #1 is in the request contention area and virtualupstream channel #2 needs to be prohibited from utilizing the area.

The fifth type of transmission opportunity is the same as the fourth onebut this time only the CMs in virtual upstream channel #2 will be usingthe broadcasted transmission opportunity and the CMs in virtual upstreamchannel #1 will not use the timeframe.

The sixth type of transmission opportunity is the case where all the CMsin virtual upstream channels #1 and #2 can use the transmissionopportunity.

The seventh type of transmission opportunity is the case where the givenmulticasted transmission opportunity will only be used by the CMs thatbelong to the in virtual upstream channel #1 and the CMs that belong invirtual upstream channel #2 will not transmit.

The eight type of transmission opportunity the same as the seventh onebut this time only the CMs in virtual upstream channel #1 will be usingthe multicasted transmission opportunity and the CMs in virtual upstreamchannel #2 will not use the timeframe allotted.

The ninth type of transmission opportunity all the CMs in both invirtual upstream channels #1 and #2 can use the transmissionopportunity.

Synchronization of IE Offsets Between VU Channels

It should be noted that the IEs in both MAPs should be time aligned forthe transmission opportunities. Sometimes this may cause some time to bewasted in order to synchronize both virtual upstream channel bandwidthallocation MAP IEs.

TABLE 3 IE synchronization wasting bandwidth due to mini-slot/symbolrate differences. IEs of VU Channel #1 IEs of VU Channel #2 SID IUCOffset SID IUC Offset 1 00x0001 6 5 0x0000 6 1 2 00x0000 6 123 3 0x00006 384 0x0002 6 3 4 00x0003 6 120 0x0000 6 1 5 00x0000 6 8

In Table 3, assume that virtual upstream channel #1 uses a mini-slotsize that is equivalent to 1 ticks (6.25 microseconds) and in virtualupstream channel #2 uses a 128 ticks (800 microseconds) long mini-slot.Furthermore, assume that at the beginning of IE 1, both IEs point to thesame time.

Virtual upstream channel #1 gives a unicast data opportunity for 5mini-slots. Consequently, the MAP on virtual upstream channel #2 cannotgive an opportunity smaller than one mini-slot so it gives a non-CMunicast data opportunity of 1 mini-slot.

The next-in-time transmission of virtual upstream channel #2 would startafter 123 mini-slots. At that point, virtual upstream channel #2 doesnot have any data to transmit, but it has to fill the remaining 123mini-slots. As shown above in Table 3, the remaining mini-slots arefilled with non-CM unicast data opportunity of 123 mini-slots.

Instead of the Table 3 scenario, the two non-CM unicast transmissionopportunities can be merged producing IEs such as those shown in Table4.

TABLE 4 IE synchronization merging non-CM unicast transmissionopportunities. IEs of VU Channel #1 IEs of VU Channel #2 SID IUC OffsetSID IUC Offset 1 0x0001 6 5 0x0000 6 1 2 0x0000 6 507 6 3 3 0x0002 40x0003 6 120 0x0000 6 1 5 0x0000 6 8

It would be optimal if the CMTS scheduler took these synchronizationissues into account and scheduled such that the synchronization will beminimized. If we return to Table 3 and re-organize the IEs, the resultwill be Table 5.

TABLE 5 IE synchronization optimizing for synchronization wastereduction. SID IUC Offset SID IUC Offset 1 0x0001 6 5 0x0000 6 1 30x0003 6 120 3 0x0000 6 131 4 0x0002 6 3

In describing the invention, offset calculations will be based on thesame units for the sake of simplicity. Even though the examples use thesame mini-slot size, this is merely a simplification for illustrativepurposes. The actual bandwidth allocation MAP messages may be muchcomplicated due to mini-slot size differences and/or the offsetsynchronization issues.

Grouping Users into Different Latency Groups

FIG. 17 illustrates virtual upstream channels with different requestcontention area latencies. Using virtual upstream channels with the sameupstream properties, it is possible to group CMs into different poolssuch that each user belonging to different groups will perceivedifferent latency. The latency in this context is defined as the timethat it takes a CM to receive a packet that is to be send to upstream tothe packet is received by the CMTS through upstream.

Since the interval of request contention opportunities and bandwidthallocation MAP messages are directly proportional to the latencyperceived by the users, using virtual upstream channels, the users canbe grouped into different groups that would perceive differentlatencies. For example it is possible that one group A will see arequest contention area every 10 milliseconds and other group of users Bwill see a request contention area every 5 milliseconds as shown in FIG.17.

For example now it is possible to segregate the users into provider-1and provider-2 groups and have each user in one group not to contendwith the other groups bandwidth request opportunities. If one upstreamchannel is to be used, then all the users on the request contention areahave to compete with each other and the CMTS would only make itsdecision on who gets what amount of bandwidth depending on the requestsit received.

If the above example is to be expanded, assume that provider-1 andprovider-2 has 10 users each in the upstream channel. Further assumethat in general the 45 provider-1 users use the upstream while 5provider-2 users are online (using the downstream). Even though the mainidea for provider-2 to is to supply a better service to their users,because of the peculiarity of the DOCSIS services, the requestcontention opportunity (best efforts per DOCSIS) is the best matchingservice type for Internet browsing (mainly downstream). The other choiceof request types such as real-time/non-real time polling and unsolicitedgrant service would incur a large overhead on the upstream. Since theupstream has one request contention opportunity for all the users, allthe users would have same chances of getting their packets to CMTS. Thisis not fair due to the fact that the provider-2 tried to limit thenumber of users in their network. In busy times, even though theprovider-2 has sufficient bandwidth, its users will be hit as theprovider-1's users are using most of the contention requestopportunities and all the CMs as the same chances of contenting theirrequests.

If the request contention areas of the two providers are to be separatedusing virtual upstream channels, then the users of the two providerswould not have to compete for the same request contention opportunities.Instead, they can engineer their services without worrying about otherover-subscribing people.

FIG. 18 illustrates virtual upstream channels using joint contentionareas. Joint contention areas use the same contention area for bothgroups. In this case, the two virtual upstream channels must have thesame upstream characteristics. In other words, the two virtual upstreamchannels must have the same Upstream Channel Descriptors for requestopportunities and the same symbol rate, mini-slot size, preamble etc.Using these kinds of techniques it is now possible to offer betterresponding services (e.g. for the purpose of gaming) for best-effortservices for different classes/applications of CMs.

Grouping Users to Control the Number of SIDs that can Contend in aRequest Contention Area

One side effect of the request contention area scenarios is that in theworst case, all CMs can contest for the same time frame. Assuming 200CMs in the same upstream, then it is possible to have 200 times thepower of an individual modem at the frequency. This is an unlikelyevent, but as the number of CMs that use the channel increase (due toAdvanced PHY for example) the probability that the contention areas willhave increased power will also increase.

Another advantage of virtual upstream channels is that it can constrainthe number of CMs that can transmit in a request contention area thereby reducing the chances of laser clipping. It is possible to designvirtual upstream channels such that laser clipping is eliminated. Theprobability of the laser clipping can be engineered without sacrificingthe number of users supported on a DOCSIS upstream frequency. In suchcase, the design should ensure that the number that is found as themaximum number of CMs that can use a request contention area will be thethreshold limit for the number of CMs sharing the same virtual upstreamchannel.

Although the present invention has been described in detail withreference to the disclosed embodiments thereof, those skilled in the artwill appreciate that various substitutions and modifications can be madeto the examples described herein while remaining within the spirit andscope of the invention as defined in the appended claims. Also, themethodologies described may be implemented using any combination ofsoftware, specialized hardware, firmware or a combination thereof andbuilt using ASICs, dedicated processors or other such electronicdevices.

Appendix

APPENDIX A Mini-slot size conversion chart Mini-slot Size (ticks) 1 2 48 16 32 64 128 Mini-slot Size (us) 6.25 12.5 25 50 100 200 400 800Symbol Rate Mini-slot Size (bytes) QPSK 160000 NA NA NA NA NA 8 16 32320000 NA NA NA NA 8 16 32 64 640000 NA NA NA  8 16 32 64 128 1280000 NANA  8 16 32 64 128 256 2560000 NA  8 16 32 64 128 256 512 5120000 NA 1632 64 128 256 512 1024  8-QAM 160000 NA NA NA NA NA 12 24 48 320000 NANA NA NA 12 24 48 96 640000 NA NA NA 12 24 48 96 192 1280000 NA NA 12 2448 96 192 NA 2560000 NA 12 24 48 96 192 NA NA 5120000 12 24 48 96 192 NANA NA 16-QAM 160000 NA NA NA NA NA 16 32 64 320000 NA NA NA NA 16 32 64128 640000 NA NA NA 16 32 64 128 256 1280000 NA NA 16 32 64 128 256 5122560000 NA 16 32 64 128 256 512 1024 5120000 NA 32 64 128  256 512 10242048 32-QAM 160000 NA NA NA NA NA 20 40 80 320000 NA NA NA NA 20 40 80160 640000 NA NA NA 20 40 80 160 320 1280000 NA NA 20 40 80 160 320 NA2560000 NA 20 40 80 160 320 NA NA 5120000 20 40 80 160  320 NA NA NA64-QAM 160000 NA NA NA NA NA 24 48 96 320000 NA NA NA NA 24 48 96 192640000 NA NA NA 24 48 96 192 384 1280000 NA NA 24 48 96 192 384 NA2560000 NA 24 48 96 192 384 NA NA 5120000 24 48 96 192  384 NA NA NA NA= Not allowed because of limitations specified in Appendix B of RFIspecification Note: symbol rate of 5120000 and 8-QAM, 32-QAM, and 64-QAMare introduced in the Advanced PHY specification

1-36. (canceled)
 37. A method comprising: assigning, by a device, adifferent virtual channel to each of a plurality of groups of networkdevices, where each of the assigned virtual channels is operating in adifferent modulation scheme, and where each of the plurality of groupsof network devices is associated with a same physical channel;generating, by the device, a different bandwidth allocation message foreach of the assigned virtual channels; and transmitting, by the device,the generated bandwidth allocation messages to the plurality of groupsof network devices to schedule utilization of the physical channel. 38.The method of claim 37, further comprising: scheduling a first bandwidthallocation message, of the generated bandwidth allocation messages, anda second bandwidth allocation message, of the generated bandwidthallocation messages, to prevent overlap of transmission areas of thefirst bandwidth allocation message and the second bandwidth allocationmessage on the physical channel.
 39. The method of claim 38, where thefirst bandwidth allocation message is associated with a first virtualchannel, of the assigned virtual channels, where the second bandwidthallocation message is associated with a second virtual channel, of theassigned virtual channels, and where the first bandwidth allocationmessage includes information identifying a period of time when the firstvirtual channel is used to transmit data.
 40. The method of claim 37,further comprising: allocating bandwidth to one or more network devices,of the plurality of groups of network devices, based on at least one of:quality of service information, or latency differentiation between theone or more network devices.
 41. The method of claim 40, where, when thebandwidth is allocated based on the latency differentiation, the latencydifferentiation causes a slower network device, of the one or morenetwork devices, to transmit data proportionately more frequently than afaster network device, of the one or more network devices.
 42. Themethod of claim 37, where transmitting the generated bandwidthallocation messages includes: transmitting each of the generatedbandwidth allocation messages, via a corresponding one of the virtualupstream channels, to a respective one of the plurality of groups ofnetwork devices.
 43. The method of claim 37, further comprising:determining that a first virtual upstream channel and a second virtualupstream channel, of the assigned virtual upstream channels, share thesame physical channel; and scheduling, based on the determining and thegenerated bandwidth allocation messages, transmission of data on thesame physical channel to prevent the first virtual upstream channel andthe second virtual upstream channel from simultaneously using the samephysical channel.
 44. A system comprising: a device to: assign adifferent virtual channel to each of a plurality of groups of networkdevices, generate a different bandwidth allocation message for each ofthe assigned virtual channels, where the bandwidth allocation messagesare generated based on latency differentiation between network devicesincluded in the plurality of groups of network devices, and schedule,based on the generated bandwidth allocation messages, transmission ofdata, on a physical channel, by the network devices.
 45. The system ofclaim 44, where each of the assigned virtual channels is operating in adifferent modulation scheme.
 46. The system of claim 44, where thelatency differentiation causes a slower network device, of the networkdevices, to transmit data proportionately more frequently than a fasternetwork device, of the network devices.
 47. The system of claim 44,where a first bandwidth allocation message, of the generated bandwidthallocation messages, is associated with a first virtual channel, of theassigned virtual channels, and where the first bandwidth allocationmessage includes information associated with a first period of time whenthe first virtual channel is used to transmit data on the physicalchannel and a second period of time when a second virtual channel, ofthe assigned virtual channels, is used to transmit data on the physicalchannel, the first period of time being different from the second periodof time.
 48. The system of claim 44, where the device is further to:assign another virtual channel to another group of network devices,generate another bandwidth allocation message for the assigned othervirtual channel, where the other bandwidth allocation message isgenerated based on quality of service information associated with anetwork device included in the other group of network devices.
 49. Thesystem of claim 44, the device is further to: determine whether thenetwork devices use the physical channel to transmit the data, andschedule the transmission of data on the physical channel further basedon determining that the network devices use the physical channel totransmit the data.
 50. The system of claim 44, where the device isfurther to: transmit the generated bandwidth allocation messages to thenetwork devices to schedule the transmission of data on the physicalchannel.
 51. A non-transitory computer-readable memory device includingone or more instructions, executable by a device, to perform a methodcomprising: assigning a different virtual channel to each of a pluralityof different network devices, where the assigned virtual channels areassociated with a same physical channel; generating a differentbandwidth allocation message for each of the assigned virtual channels,where each of the bandwidth allocation messages is generated based onlatency associated with a corresponding one of the plurality of networkdevices; and scheduling, based on the generated bandwidth allocationmessages, transmission of data, on the same physical channel, by one ormore network devices of the plurality of network devices.
 52. Thenon-transitory computer-readable memory device of claim 51, the methodfurther comprising: transmitting, to the plurality of network devices,the generated bandwidth allocation messages to schedule the transmissionof data on the same physical channel.
 53. The non-transitorycomputer-readable memory device of claim 52, where transmitting thegenerated bandwidth allocation messages includes: transmitting each ofthe generated bandwidth allocation messages on a corresponding one ofthe assigned virtual channels.
 54. The non-transitory computer-readablememory device of claim 51, the method further comprising: grouping theplurality of network devices into a first group of network devices and asecond group of network devices, where the plurality of network devicesare grouped based on the latency associated with each of the pluralityof network devices.
 55. The non-transitory computer-readable memorydevice of claim 51, assigning the different virtual channel includes:assigning a first virtual upstream channel to a first group of theplurality of network devices and, assigning a second virtual upstreamchannel to a second group of the plurality of network devices, where thefirst virtual upstream channel is different than the second virtualupstream channel.
 56. The non-transitory computer-readable memory deviceof claim 51, where a first bandwidth allocation message, of thegenerated bandwidth allocation messages, is associated with a firstvirtual channel, of the assigned virtual channels, and where the firstbandwidth allocation message includes information associated with afirst period of time when the first virtual channel is used to transmitdata on the physical channel and a second period of time when the firstvirtual channel is not used to transmit data on the same physicalchannel.